kw.\*:("Arbol contextual")
Results 1 to 16 of 16
Selection :
Type Classes of Context TreesMARTIN, Alvaro; SEROUSSI, Gadiel; WEINBERGER, Marcelo J et al.IEEE transactions on information theory. 2012, Vol 58, Num 7, pp 4077-4093, issn 0018-9448, 17 p.Article
BIC Context Tree Estimation for Stationary Ergodic ProcessesTALATA, Zsolt; DUNCAN, Tyrone E.IEEE transactions on information theory. 2011, Vol 57, Num 6, pp 3877-3886, issn 0018-9448, 10 p.Article
Context Tree Estimation in Variable Length Hidden Markov ModelsDUMONT, Thierry.IEEE transactions on information theory. 2014, Vol 60, Num 6, pp 3196-3208, issn 0018-9448, 13 p.Article
On context-tree prediction of individual sequencesZIV, Jacob; MERHAV, Neri.IEEE transactions on information theory. 2007, Vol 53, Num 5, pp 1860-1866, issn 0018-9448, 7 p.Article
On Multi-Directional Context SetsORDENTLICH, Erik; WEINBERGER, Marcelo J; CHENG CHANG et al.IEEE transactions on information theory. 2011, Vol 57, Num 10, pp 6827-6836, issn 0018-9448, 10 p.Article
Lossless compression of map contours by context tree modeling of chain codesAKIMOV, Alexander; KOLESNIKOV, Alexander; FRÄNTI, Pasi et al.Pattern recognition. 2007, Vol 40, Num 3, pp 944-952, issn 0031-3203, 9 p.Article
Universal divergence estimation for finite-alphabet sourcesHAIXIAO CAI; KULKARNI, Sanjeev R; VERDU, Sergio et al.IEEE transactions on information theory. 2006, Vol 52, Num 8, pp 3456-3475, issn 0018-9448, 20 p.Article
Universal Reinforcement LearningFARIAS, Vivek F; MOALLEMI, Ciamac C; VAN ROY, Benjamin et al.IEEE transactions on information theory. 2010, Vol 56, Num 5, pp 2441-2454, issn 0018-9448, 14 p.Article
An algorithm for universal lossless compression with side informationHAIXIAO CAI; KULKARNI, Sanjeev R; VERDU, Sergio et al.IEEE transactions on information theory. 2006, Vol 52, Num 9, pp 4008-4016, issn 0018-9448, 9 p.Article
Universal Estimation of Erasure EntropyJIMING YU; VERDU, Sergio.IEEE transactions on information theory. 2009, Vol 55, Num 1, pp 350-357, issn 0018-9448, 8 p.Article
Redundancy of the context-tree weighting method on renewal and markov renewal processesGARIVIER, Aunélien.IEEE transactions on information theory. 2006, Vol 52, Num 12, pp 5579-5586, issn 0018-9448, 8 p.Article
Context Coding of Depth Map Images Under the Piecewise-Constant Image Model RepresentationTABUS, Ioan; SCHIOPU, Ionut; ASTOLA, Jaakko et al.IEEE transactions on image processing. 2013, Vol 22, Num 11-12, pp 4195-4210, issn 1057-7149, 16 p.Article
The Universal LZ77 Compression Algorithm Is Essentially Optimal for Individual Finite-Length N-BlocksZIV, Jacob.IEEE transactions on information theory. 2009, Vol 55, Num 5, pp 1941-1944, issn 0018-9448, 4 p.Article
Consistency of the unlimited BIC context tree estimatorGARIVIER, Aurélien.IEEE transactions on information theory. 2006, Vol 52, Num 10, pp 4630-4635, issn 0018-9448, 6 p.Article
Individual Sequence Prediction Using Memory-Efficient Context TreesDEKEL, Ofer; SHALEV-SHWARTZ, Shai; SINGER, Yoram et al.IEEE transactions on information theory. 2009, Vol 55, Num 11, pp 5251-5262, issn 0018-9448, 12 p.Article
Learning probabilistic models of tree edit distanceBERNARD, Marc; BOYER, Laurent; HABRARD, Amaury et al.Pattern recognition. 2008, Vol 41, Num 8, pp 2611-2629, issn 0031-3203, 19 p.Article